Streaming algorithms for multitasking scheduling with shared processing

In this paper, we design the first streaming algorithms for problem of multitasking scheduling on parallel machines with shared processing. one pass, our approximation schemes can provide an approximate value optimal makespan. If jobs be read in two passes, algorithm find schedule value. This work not only provides algorithmic big data solution studied problem, but also gives insight into other problems area scheduling.